Task assignment in multiple server farms using preemptive migration and flow control
نویسندگان
چکیده
Existing task assignment policies proposed for assigning tasks in stand-alone server farms are not efficient in multiple server farm environments because they have not been designed to exploit the properties of such environments.With the emergence of high speed networks and operating systems that have features such as preemptive migration, the importance of designing task assignment policies for assigning tasks in multiple server farms has increased. Such policies can result in better overall performance compared to those that optimise performance in stand-alone server farms. This paper proposes a task assignment policy suitable for assigning tasks in multiple server farms. The proposed policy, called Multi-Cluster Task Assignment based on Preemptive Migration (MCTPM) is based on amulti-tier host architecture that reduces the variance of task sizes in host queues by processing tasks with similar sizes using a set of hosts that have a distinct task size range. MCTPM controls the traffic flow into server farms via a global dispatching device so as to optimise the performance. MCTPM supports preemptive task migration between servers in the same farm and between servers in different farms. Performance analysis of the proposed policy indicates that significant performance improvements are possible under a wide range of workload scenarios. For example, MCTPM outperforms existing policies such asMC-Random,MC-TAGSPMandMC-MTTPMby factors of 190, 5 and 10.5 respectively under certain scenarios. Crown Copyright© 2011 Published by Elsevier Inc. All rights reserved.
منابع مشابه
Scheduling of Multiple Autonomous Guided Vehicles for an Assembly Line Using Minimum Cost Network Flow
This paper proposed a parallel automated assembly line system to produce multiple products having multiple autonomous guided vehicles (AGVs). Several assembly lines are configured to produce multiple products in which the technologies of machines are shared among the assembly lines when required. The transportation between the stations in an assembly line (intra assembly line) and among station...
متن کاملOn Finite Queue with Two Types of Failures and Preemptive Priority (RESEARCH NOTE)
We study the single server queueing system with two types of Abstract failure to servicechannels including the preemptive priority to the repair of major failure. The units arrive at thesystem in a poisson fashion and are served exponenitally. The steady - state probabilities ofvarious states by using generating function have been obtained.
متن کاملRobust Preemptive Resource Assignment for Multiple Software Projects Using Parameter Design
Project preemption allows resources flow passively from one project or task to another. Due to high-cost and high-risk characteristics of software development, project preemption might have a significant impact on the ultimate completion time of a software project. This article examines the feasibility of the Taguchi’s parameter design to achieve robust resource assignment for multiple software...
متن کاملTask Assignment Based on Prioritising Traffic Flows
We consider the issue of task assignment in a distributed system under heavy-tailed (ie. highly variable) workloads. A new adaptable approach called TAPTF (Task Assignment based on Prioritising Traffic Flows) is proposed, which improves performance under heavy-tailed workloads for certain classes of traffic. TAPTF controls the influx of tasks to each host, enables service differentiation throug...
متن کاملUsing Agents for Parallel Programming in Workstation Networks
Actual systems supporting dynamic load distribution for parallel programs such as Dynamo [3] manage load distribution by directing the assignment of newly generated subproblems to processes of the parallel program (non-preemptive load distribution). This so called task farming paradigm is only useful for a relatively small number of applications. Most numerical algorithms and simulation program...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Parallel Distrib. Comput.
دوره 71 شماره
صفحات -
تاریخ انتشار 2011